0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.11 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.10/0.31 % Computer : n004.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1200 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Tue Jul 13 15:23:39 EDT 2021 0.10/0.31 % CPUTime : 0.10/0.31 % Number of cores: 8 0.10/0.31 % Python version: Python 3.6.8 0.10/0.31 # Version: 2.6rc1-ho 0.10/0.31 # No SInE strategy applied 0.10/0.31 # Trying AutoSched0 for 59 seconds 0.72/0.94 # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN 0.72/0.94 # and selection function SelectComplexExceptUniqMaxHorn. 0.72/0.94 # 0.72/0.94 # Preprocessing time : 0.029 s 0.72/0.94 # Presaturation interreduction done 0.72/0.94 0.72/0.94 # Proof found! 0.72/0.94 # SZS status Theorem 0.72/0.94 # SZS output start CNFRefutation 0.72/0.94 thf(six_ax, axiom, (six)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', six_ax)). 0.72/0.94 thf(five_ax, axiom, (five)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', five_ax)). 0.72/0.94 thf(seven_ax, axiom, (seven)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', seven_ax)). 0.72/0.94 thf(two_ax, axiom, (two)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', two_ax)). 0.72/0.94 thf(succ_ax, axiom, (succ)=(^[X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X1 @ (X3 @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', succ_ax)). 0.72/0.94 thf(eight_ax, axiom, (eight)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', eight_ax)). 0.72/0.94 thf(three_ax, axiom, (three)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ X2))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', three_ax)). 0.72/0.94 thf(nine_ax, axiom, (nine)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', nine_ax)). 0.72/0.94 thf(zero_ax, axiom, (zero)=(^[X1:$i > $i, X2:$i]:X2), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', zero_ax)). 0.72/0.94 thf(ten_ax, axiom, (ten)=(^[X1:$i > $i, X2:$i]:X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))))), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', ten_ax)). 0.72/0.94 thf(mult_ax, axiom, (mult)=(^[X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X4 @ (X3 @ X1) @ X2), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', mult_ax)). 0.72/0.94 thf(plus_ax, axiom, (plus)=(^[X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X4 @ X1 @ (X3 @ X1 @ X2)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM006^0.ax', plus_ax)). 0.72/0.94 thf(thm, conjecture, (mult @ ten @ (mult @ ten @ ten))=(mult @ (plus @ ten @ ten) @ (mult @ five @ ten)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thm)). 0.72/0.94 thf(c_0_13, plain, ![X1:$i > $i, X2:$i]:(six @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))), inference(fof_simplification,[status(thm)],[six_ax])). 0.72/0.94 thf(c_0_14, plain, ![X1:$i > $i, X2:$i]:(five @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))), inference(fof_simplification,[status(thm)],[five_ax])). 0.72/0.94 thf(c_0_15, plain, ![X1:$i > $i, X2:$i]:(seven @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))), inference(fof_simplification,[status(thm)],[seven_ax])). 0.72/0.94 thf(c_0_16, plain, ![X17:$i > $i, X18:$i]:(six @ X17 @ X18)=(X17 @ (X17 @ (X17 @ (X17 @ (X17 @ (X17 @ X18)))))), inference(variable_rename,[status(thm)],[c_0_13])). 0.72/0.94 thf(c_0_17, plain, ![X15:$i > $i, X16:$i]:(five @ X15 @ X16)=(X15 @ (X15 @ (X15 @ (X15 @ (X15 @ X16))))), inference(variable_rename,[status(thm)],[c_0_14])). 0.72/0.94 thf(c_0_18, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ X2)=(X1 @ (X1 @ X2)), inference(fof_simplification,[status(thm)],[two_ax])). 0.72/0.94 thf(c_0_19, plain, ![X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(succ @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(fof_simplification,[status(thm)],[succ_ax])). 0.72/0.94 thf(c_0_20, plain, ![X1:$i > $i, X2:$i]:(eight @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))), inference(fof_simplification,[status(thm)],[eight_ax])). 0.72/0.94 thf(c_0_21, plain, ![X19:$i > $i, X20:$i]:(seven @ X19 @ X20)=(X19 @ (X19 @ (X19 @ (X19 @ (X19 @ (X19 @ (X19 @ X20))))))), inference(variable_rename,[status(thm)],[c_0_15])). 0.72/0.94 thf(c_0_22, plain, ![X1:$i > $i, X2:$i]:(six @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))), inference(split_conjunct,[status(thm)],[c_0_16])). 0.72/0.94 thf(c_0_23, plain, ![X1:$i > $i, X2:$i]:(five @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.72/0.94 thf(c_0_24, plain, ![X1:$i > $i, X2:$i]:(three @ X1 @ X2)=(X1 @ (X1 @ (X1 @ X2))), inference(fof_simplification,[status(thm)],[three_ax])). 0.72/0.94 thf(c_0_25, plain, ![X9:$i > $i, X10:$i]:(two @ X9 @ X10)=(X9 @ (X9 @ X10)), inference(variable_rename,[status(thm)],[c_0_18])). 0.72/0.94 thf(c_0_26, plain, ![X27:($i > $i) > $i > $i, X28:$i > $i, X29:$i]:(succ @ X27 @ X28 @ X29)=(X28 @ (X27 @ X28 @ X29)), inference(variable_rename,[status(thm)],[c_0_19])). 0.72/0.94 thf(c_0_27, plain, ![X1:$i > $i, X2:$i]:(nine @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))))), inference(fof_simplification,[status(thm)],[nine_ax])). 0.72/0.94 thf(c_0_28, plain, ![X21:$i > $i, X22:$i]:(eight @ X21 @ X22)=(X21 @ (X21 @ (X21 @ (X21 @ (X21 @ (X21 @ (X21 @ (X21 @ X22)))))))), inference(variable_rename,[status(thm)],[c_0_20])). 0.72/0.94 thf(c_0_29, plain, ![X1:$i > $i, X2:$i]:(seven @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.72/0.94 thf(c_0_30, plain, ![X1:$i > $i, X2:$i]:(X1 @ (five @ X1 @ X2))=(six @ X1 @ X2), inference(rw,[status(thm)],[c_0_22, c_0_23])). 0.72/0.94 thf(c_0_31, plain, ![X11:$i > $i, X12:$i]:(three @ X11 @ X12)=(X11 @ (X11 @ (X11 @ X12))), inference(variable_rename,[status(thm)],[c_0_24])). 0.72/0.94 thf(c_0_32, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ X2)=(X1 @ (X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_25])). 0.72/0.94 thf(c_0_33, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(succ @ X3 @ X1 @ X2)=(X1 @ (X3 @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_26])). 0.72/0.94 thf(c_0_34, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(fof_simplification,[status(thm)],[zero_ax])). 0.72/0.94 thf(c_0_35, plain, ![X1:$i > $i, X2:$i]:(ten @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))))), inference(fof_simplification,[status(thm)],[ten_ax])). 0.72/0.94 thf(c_0_36, plain, ![X23:$i > $i, X24:$i]:(nine @ X23 @ X24)=(X23 @ (X23 @ (X23 @ (X23 @ (X23 @ (X23 @ (X23 @ (X23 @ (X23 @ X24))))))))), inference(variable_rename,[status(thm)],[c_0_27])). 0.72/0.94 thf(c_0_37, plain, ![X1:$i > $i, X2:$i]:(eight @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))), inference(split_conjunct,[status(thm)],[c_0_28])). 0.72/0.94 thf(c_0_38, plain, ![X1:$i > $i, X2:$i]:(X1 @ (six @ X1 @ X2))=(seven @ X1 @ X2), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_23]), c_0_30])). 0.72/0.94 thf(c_0_39, plain, ![X1:$i > $i, X2:$i]:(three @ X1 @ X2)=(X1 @ (X1 @ (X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_31])). 0.72/0.94 thf(c_0_40, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(X1 @ (succ @ X3 @ X1 @ X2))=(two @ X1 @ (X3 @ X1 @ X2)), inference(spm,[status(thm)],[c_0_32, c_0_33])). 0.72/0.94 thf(c_0_41, plain, ![X5:$i > $i, X6:$i]:(zero @ X5 @ X6)=(X6), inference(variable_rename,[status(thm)],[c_0_34])). 0.72/0.94 thf(c_0_42, plain, ![X25:$i > $i, X26:$i]:(ten @ X25 @ X26)=(X25 @ (X25 @ (X25 @ (X25 @ (X25 @ (X25 @ (X25 @ (X25 @ (X25 @ (X25 @ X26)))))))))), inference(variable_rename,[status(thm)],[c_0_35])). 0.72/0.94 thf(c_0_43, plain, ![X1:$i > $i, X2:$i]:(nine @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2))))))))), inference(split_conjunct,[status(thm)],[c_0_36])). 0.72/0.94 thf(c_0_44, plain, ![X1:$i > $i, X2:$i]:(X1 @ (seven @ X1 @ X2))=(eight @ X1 @ X2), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_23]), c_0_30]), c_0_38])). 0.72/0.94 thf(c_0_45, plain, ![X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(mult @ X4 @ X3 @ X1 @ X2)=(X4 @ (X3 @ X1) @ X2), inference(fof_simplification,[status(thm)],[mult_ax])). 0.72/0.94 thf(c_0_46, plain, ![X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(plus @ X4 @ X3 @ X1 @ X2)=(X4 @ X1 @ (X3 @ X1 @ X2)), inference(fof_simplification,[status(thm)],[plus_ax])). 0.72/0.94 thf(c_0_47, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(X1 @ (two @ X1 @ (X3 @ X1 @ X2)))=(three @ X1 @ (X3 @ X1 @ X2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_33]), c_0_40])). 0.72/0.94 thf(c_0_48, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(split_conjunct,[status(thm)],[c_0_41])). 0.72/0.94 thf(c_0_49, plain, ![X1:$i > $i, X2:$i]:(ten @ X1 @ X2)=(X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ (X1 @ X2)))))))))), inference(split_conjunct,[status(thm)],[c_0_42])). 0.72/0.94 thf(c_0_50, plain, ![X1:$i > $i, X2:$i]:(X1 @ (eight @ X1 @ X2))=(nine @ X1 @ X2), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43, c_0_23]), c_0_30]), c_0_38]), c_0_44])). 0.72/0.94 thf(c_0_51, plain, ![X34:($i > $i) > $i > $i, X35:($i > $i) > $i > $i, X36:$i > $i, X37:$i]:(mult @ X34 @ X35 @ X36 @ X37)=(X34 @ (X35 @ X36) @ X37), inference(variable_rename,[status(thm)],[c_0_45])). 0.72/0.94 thf(c_0_52, plain, ![X30:($i > $i) > $i > $i, X31:($i > $i) > $i > $i, X32:$i > $i, X33:$i]:(plus @ X30 @ X31 @ X32 @ X33)=(X30 @ X32 @ (X31 @ X32 @ X33)), inference(variable_rename,[status(thm)],[c_0_46])). 0.72/0.94 thf(c_0_53, plain, ![X1:$i > $i, X2:$i]:(X1 @ (two @ X1 @ X2))=(three @ X1 @ X2), inference(spm,[status(thm)],[c_0_47, c_0_48])). 0.72/0.94 thf(c_0_54, plain, ![X1:$i > $i, X2:$i]:(three @ X1 @ (X1 @ (X1 @ (X1 @ X2))))=(two @ (three @ X1) @ X2), inference(spm,[status(thm)],[c_0_32, c_0_39])). 0.72/0.94 thf(c_0_55, plain, ![X1:$i > $i, X2:$i]:(X1 @ (nine @ X1 @ X2))=(ten @ X1 @ X2), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49, c_0_23]), c_0_30]), c_0_38]), c_0_44]), c_0_50])). 0.72/0.94 thf(c_0_56, negated_conjecture, (mult @ ten @ (mult @ ten @ ten))!=(mult @ (plus @ ten @ ten) @ (mult @ five @ ten)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thm])])). 0.72/0.94 thf(c_0_57, plain, ![X1:$i > $i, X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X2:$i]:(mult @ X3 @ X4 @ X1 @ X2)=(X3 @ (X4 @ X1) @ X2), inference(split_conjunct,[status(thm)],[c_0_51])). 0.72/0.94 thf(c_0_58, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X4:($i > $i) > $i > $i, X2:$i]:(plus @ X3 @ X4 @ X1 @ X2)=(X3 @ X1 @ (X4 @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_52])). 0.72/0.94 thf(c_0_59, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ (X1 @ X2))=(three @ X1 @ X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_32]), c_0_53])). 0.72/0.94 thf(c_0_60, plain, ![X1:$i > $i, X2:$i]:(two @ (three @ X1) @ X2)=(six @ X1 @ X2), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_54]), c_0_23]), c_0_30])). 0.72/0.94 thf(c_0_61, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ (six @ X1 @ X2))=(eight @ X1 @ X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_38]), c_0_44])). 0.72/0.94 thf(c_0_62, plain, ![X1:$i > $i, X2:$i]:(two @ X1 @ (eight @ X1 @ X2))=(ten @ X1 @ X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_50]), c_0_55])). 0.72/0.94 thf(c_0_63, negated_conjecture, (mult @ ten @ (mult @ ten @ ten))!=(mult @ (plus @ ten @ ten) @ (mult @ five @ ten)), inference(split_conjunct,[status(thm)],[c_0_56])). 0.72/0.94 thf(c_0_64, plain, ![X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i]:(mult @ X3 @ X4 @ X1)=(X3 @ (X4 @ X1)), inference(pos_ext,[status(thm)],[c_0_57])). 0.72/0.94 thf(c_0_65, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(plus @ X3 @ X3 @ X1 @ X2)=(two @ (X3 @ X1) @ X2), inference(spm,[status(thm)],[c_0_32, c_0_58])). 0.72/0.94 thf(c_0_66, plain, ![X1:$i > $i, X2:$i]:(two @ (five @ X1) @ X2)=(ten @ X1 @ X2), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_30]), c_0_38]), c_0_44]), c_0_50]), c_0_55]), c_0_32])). 0.72/0.94 thf(c_0_67, plain, ![X1:$i > $i, X2:$i]:(five @ (two @ X1) @ X2)=(ten @ X1 @ X2), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_32]), c_0_53]), c_0_59]), c_0_32]), c_0_60]), c_0_61]), c_0_62])). 0.72/0.94 thf(c_0_68, negated_conjecture, (plus @ ten @ ten @ (five @ (ten @ esk1_1)))!=(ten @ (ten @ (ten @ esk1_1))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_63]), c_0_64]), c_0_64]), c_0_64]), c_0_64])). 0.72/0.94 thf(c_0_69, plain, ![X3:($i > $i) > $i > $i, X1:$i > $i]:(plus @ X3 @ X3 @ X1)=(two @ (X3 @ X1)), inference(pos_ext,[status(thm)],[c_0_65])). 0.72/0.94 thf(c_0_70, plain, ![X1:$i > $i]:(two @ (five @ X1))=(ten @ X1), inference(pos_ext,[status(thm)],[c_0_66])). 0.72/0.94 thf(c_0_71, plain, ![X1:$i > $i]:(five @ (two @ X1))=(ten @ X1), inference(pos_ext,[status(thm)],[c_0_67])). 0.72/0.94 thf(c_0_72, negated_conjecture, (two @ (ten @ (five @ (ten @ esk1_1))))!=(ten @ (ten @ (ten @ esk1_1))), inference(rw,[status(thm)],[c_0_68, c_0_69])). 0.72/0.94 thf(c_0_73, plain, ![X1:$i > $i]:(two @ (ten @ X1))=(ten @ (two @ X1)), inference(spm,[status(thm)],[c_0_70, c_0_71])). 0.72/0.94 thf(c_0_74, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72, c_0_73]), c_0_70])]), ['proof']). 0.72/0.94 # SZS output end CNFRefutation 0.72/0.94 # Proof object total steps : 75 0.72/0.94 # Proof object clause steps : 37 0.72/0.94 # Proof object formula steps : 38 0.72/0.94 # Proof object conjectures : 6 0.72/0.94 # Proof object clause conjectures : 4 0.72/0.94 # Proof object formula conjectures : 2 0.72/0.94 # Proof object initial clauses used : 13 0.72/0.94 # Proof object initial formulas used : 13 0.72/0.94 # Proof object generating inferences : 12 0.72/0.94 # Proof object simplifying inferences : 40 0.72/0.94 # Training examples: 0 positive, 0 negative 0.72/0.94 # Parsed axioms : 29 0.72/0.94 # Removed by relevancy pruning/SinE : 0 0.72/0.94 # Initial clauses : 29 0.72/0.94 # Removed in clause preprocessing : 14 0.72/0.94 # Initial clauses in saturation : 15 0.72/0.94 # Processed clauses : 3037 0.72/0.94 # ...of these trivial : 168 0.72/0.94 # ...subsumed : 1253 0.72/0.94 # ...remaining for further processing : 1616 0.72/0.94 # Other redundant clauses eliminated : 1467 0.72/0.94 # Clauses deleted for lack of memory : 0 0.72/0.94 # Backward-subsumed : 14 0.72/0.94 # Backward-rewritten : 93 0.72/0.94 # Generated clauses : 40403 0.72/0.94 # ...of the previous two non-trivial : 36714 0.72/0.94 # Contextual simplify-reflections : 8 0.72/0.94 # Paramodulations : 25646 0.72/0.94 # Factorizations : 0 0.72/0.94 # NegExts : 3266 0.72/0.94 # Equation resolutions : 1467 0.72/0.94 # Propositional unsat checks : 0 0.72/0.94 # Propositional check models : 0 0.72/0.94 # Propositional check unsatisfiable : 0 0.72/0.94 # Propositional clauses : 0 0.72/0.94 # Propositional clauses after purity: 0 0.72/0.94 # Propositional unsat core size : 0 0.72/0.94 # Propositional preprocessing time : 0.000 0.72/0.94 # Propositional encoding time : 0.000 0.72/0.94 # Propositional solver time : 0.000 0.72/0.94 # Success case prop preproc time : 0.000 0.72/0.94 # Success case prop encoding time : 0.000 0.72/0.94 # Success case prop solver time : 0.000 0.72/0.94 # Current number of processed clauses : 1494 0.72/0.94 # Positive orientable unit clauses : 165 0.72/0.94 # Positive unorientable unit clauses: 11 0.72/0.94 # Negative unit clauses : 5 0.72/0.94 # Non-unit-clauses : 1313 0.72/0.94 # Current number of unprocessed clauses: 33692 0.72/0.94 # ...number of literals in the above : 82189 0.72/0.94 # Current number of archived formulas : 0 0.72/0.94 # Current number of archived clauses : 122 0.72/0.94 # Clause-clause subsumption calls (NU) : 904007 0.72/0.94 # Rec. Clause-clause subsumption calls : 454332 0.72/0.94 # Non-unit clause-clause subsumptions : 1195 0.72/0.94 # Unit Clause-clause subsumption calls : 198 0.72/0.94 # Rewrite failures with RHS unbound : 0 0.72/0.94 # BW rewrite match attempts : 894 0.72/0.94 # BW rewrite match successes : 78 0.72/0.94 # Condensation attempts : 0 0.72/0.94 # Condensation successes : 0 0.72/0.94 # Termbank termtop insertions : 456004 0.72/0.95 0.72/0.95 # ------------------------------------------------- 0.72/0.95 # User time : 0.615 s 0.72/0.95 # System time : 0.018 s 0.72/0.95 # Total time : 0.633 s 0.72/0.95 # Maximum resident set size: 1676 pages 0.72/0.95 EOF